Szymon Grabowski

Źããã Ò Úò Ëëñôððö Ðôôôôø¹áòòòôòòòòø

A general compression algorithm that supports fast searching

The task of compressed pattern matching [2] is to report all the occurences of a given pattern P in a text T available in compressed form. Certain compression algorithms allow for searching without prior decoding which may be practical, especially if the search is faster than in the non-compressed representation. Most of the known schemes, however, either assume a text formed into words, or are...

Multiple Pattern Matching Revisited

We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method p...

Preprocessing for Real-Time Handwritten Character Recognition

We present a real-time on-line handwritten character recognition system , based on an ensemble of neural networks. In this work we focus on the developed preprocessing algorithms which help achieve high accuracy rate without a visible delay in recognition process.

Simple Techniques for Plagiarism Detection in Student Programming Projects

In this paper we deal with the stealing program code problem. The specific of plagiarism attempts concerning the work of a programmer is that in most programming languages it is very easy to change the “look” of a piece of code without changing its semantics at all. Basically, plagiarism detection algorithms look at either the code structure or just specific phrases. We experiment with the latt...